Matrix - Dependent Multigrid - Homogenization
نویسنده
چکیده
For problems with strongly varying or discontinuous diiusion coeecients we present a method to compute coarse-scale operators and to approximately determine the eeective diiusion tensor on the coarse-scale level. The approach is based on techniques that are used in multigrid, such as matrix-dependent prolongations and the construction of coarse grid operators by means of the Galerkin approximation. In numerical experiments we compare our multigrid-homogenization method with continuous homogenization, renormalization and simple averaging approaches.
منابع مشابه
Matrix-Dependent Multigrid Homogenization for Diffusion Problems
For problems with strongly varying or discontinuous diiusion coeecients we present a method to compute coarse-scale operators and to approximately determine the eeective diiusion tensor on the coarse-scale level. The approach is based on techniques that are used in multigrid, such as matrix-dependent prolongations and the construction of coarse-grid operators by means of the Galerkin approximat...
متن کاملOn Multiresolution Methods in Numerical Analysis 4832
As a way to emphasize several distinct features of the mul-tiresolution methods based on wavelets, we describe connections between the multiresolution LU decomposition, multigrid and multiresolution re-duction/homogenization for self-adjoint, strictly elliptic operators. We point out that the multiresolution LU decomposition resembles a direct multigrid method (without W-cycles) and that the al...
متن کاملThe Black Box Multigrid Numerical Homogenization Algorithm
In mathematical models of ow through porous media, the coe cients typically exhibit severe variations in two or more signi cantly di erent length scales. Consequently, the numerical treatment of these problems relies on a homogenization or upscaling procedure to de ne an approximate coarse-scale problem that adequately captures the in uence of the ne-scale structure. Inherent in such a procedur...
متن کاملMultigrid algorithm from cyclic reduction for Markovian queueing networks
A multigrid method based on cyclic reduction strategy is proposed to solve huge, nonsymmetric singular linear systems arising from Markovian queueing networks. A simple way to construct the matrix-dependent prolongation and restriction operators is presented in this paper. Numerical results for multiple queues are given to illustrate the efficiency and robustness of our methods.
متن کاملMultilevel approximations in sample-based inversion from the Dirichlet-to-Neumann map
In 2005, Christen and Fox introduced a delayed acceptance Metropolis-Hastings (DAMH) algorithm that improved computational efficiency in sample-based imaging of electrical conductivity (EIT). That work used a linear approximation to the forward map in the first step of the algorithm. In this paper, we develop an alternative approximation for use in DAMH, namely a multilevel approximation develo...
متن کامل